منابع مشابه
On the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملDistance-regular Cayley graphs on dihedral groups
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
متن کاملBounds for Domination Parameters in Cayley Graphs on Dihedral Group
In this paper, sharp upper bounds for the domination number, total domination number and connected domination number for the Cayley graph G = Cay(D2n, Ω) constructed on the finite dihedral group D2n, and a specified generating set Ω of D2n. Further efficient dominating sets in G = Cay(D2n, Ω) are also obtained. More specifically, it is proved that some of the proper subgroups of D2n are efficie...
متن کاملHamilton paths in Cayley graphs on generalized dihedral groups
We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.
متن کاملOn flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279–292]. He proved that this conjecture is true with 6 replaced by 216. Zyka proved in his Ph.D dissertation that it is true with 6 replaced by 30. Khelladi prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22427